Maximal solutions for the ∞-eigenvalue problem

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Solutions to a quadratic inverse eigenvalue problem

In this paper, we consider the quadratic inverse eigenvalue problem (QIEP) of constructing real symmetric matrices M,C, and K of size n× n, with (M,C,K) / = 0, so that the quadratic matrix polynomial Q(λ) = λ2M + λC +K has m (n < m 2n) prescribed eigenpairs. It is shown that, for almost all prescribed eigenpairs, the QIEP has a solution with M nonsingular if m < m∗, and has only solutions with ...

Existence of Solutions for an Eigenvalue Problem with Weight

In this work we study the existence of solutions for the nonlinear eigenvalue problem with p-biharmonic ∆pu = λm(x)|u|p−2u in a smooth bounded domain under Neumann boundary conditions.

Solutions of the Partially Described Inverse Quadratic Eigenvalue Problem

On the nonnegative inverse eigenvalue problem of traditional matrices

In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.